Fingerprinting With Minimum Distance Decoding
نویسندگان
چکیده
منابع مشابه
Minimum Distance Decoding
Suppose we have a concatenated code where the outer code is an [N,K,D]Q code, and the inner code is an [n, k, d]q code, with Q = q. In section 4 we will see that the concatenated code is actually an [Nn,Kk, Dd]q code, but for now we will show the weaker property that it is an [Nn,Kk, Dd/2]q. Consider the näıve decoding procedure which uses the inner decoding scheme on each received symbol, then...
متن کاملGeneralized minimum distance decoding with arbitrary error, erasure tradeoff
In their most basic form, concatenated codes consist of an outer and an inner code. The task of the outer code is to protect payload data, while the inner code protects the symbols of the outer code. This allows one to construct codes that are tailored for a given communication channel. One example for outer codes is the famous class of Reed–Solomon (RS) codes. It is well-studied and allows for...
متن کاملGeneralized Minimum Distance Decoding for Correcting Array Errors
We consider an array error model for data in matrix form, where the corrupted symbols are confined to a number of lines (rows and columns) of the matrix. Codes in array metric (maximum term rank metric) are well suited for error correction in this case. We generalize the array metric to the case when the reliability of every line of the matrix is available. We propose a minimum distance decoder...
متن کاملLecture 28 : Generalized Minimum Distance Decoding November 5 , 2007
This condition is implied by (1). Thus, we have proved one can correct e errors under (1). Now we have to prove that one can correct the s erasures under (1). Let z′ be the output after correcting e errors. Now we extend z′ to z ∈ (F∪ {?}) in the natural way. Finally, run the erasure decoding algorithm on z. This works as long as s < (n− k + 1), which in turn is true by (1). The time complexity...
متن کاملOn Generalized Minimum Distance Decoding Thresholds for the AWGN Channel
We consider the Additive White Gaussian Noise channel with Binary Phase Shift Keying modulation. Our aim is to enable an algebraic hard decision Bounded Minimum Distance decoder for a binary block code to exploit soft information obtained from the demodulator. This idea goes back to Forney [1], [2] and is based on treating received symbols with low reliability as erasures. This erasing at the d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Forensics and Security
سال: 2009
ISSN: 1556-6013
DOI: 10.1109/tifs.2008.2012201